A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding
نویسندگان
چکیده
منابع مشابه
Hardware-Based ADMM-LP Decoding
In this paper we present an FPGA-based implementation of linear programming (LP) decoding. LP decoding frames error correction as an optimization problem. This is in contrast to variants of belief propagation (BP) decoding that view error correction as a problem of graphical inference. There are many advantages to taking the optimization perspective: convergence guarantees, improved performance...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملA reduced-complexity algorithm for combined equalization and decoding
This paper presents a new application of a suboptimal trellis decoding algorithm for combined equalization and decoding. The proposed algorithm can outperform the reduced-state sequence estimator (RSSE) of the same order of complexity. The algorithm, termed estimated future decision-feedback algorithm (EFDFA), was originally proposed for the problem of noncoherent decoding with multiple-symbol ...
متن کاملA Reduced-complexity Ldpc Decoding Algorithm with Chebyshev Polynomial Fitting
BP decoding algorithm is a high-performance low-density parity-check (LDPC) code decoding algorithm, but because of its high complexity, it can’t be applied to the high-speed communications systems. So in order to further reduce the implementation complexity with the minimum affection to the system performance, , we proposed a BP algorithm based on Chebyshev polynomial fitting for its good appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2020.2984247